YES 1.093
↳ HASKELL
↳ LR
((findIndex :: (a -> Bool) -> [a] -> Maybe Int) :: (a -> Bool) -> [a] -> Maybe Int) |
import qualified Maybe import qualified Prelude |
|||||||||||||||||
findIndex :: (a -> Bool) -> [a] -> Maybe Int
|
|||||||||||||||||
findIndices :: (a -> Bool) -> [a] -> [Int]
|
import qualified List import qualified Prelude |
|||||||||
listToMaybe :: [a] -> Maybe a
|
\vv1→
case vv1 of (x,i) → if p x then i : [] else [] _ → []
findIndices0 p vv1 =
case vv1 of (x,i) → if p x then i : [] else [] _ → []
\ab→(a,b)
zip0 a b = (a,b)
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
((findIndex :: (a -> Bool) -> [a] -> Maybe Int) :: (a -> Bool) -> [a] -> Maybe Int) |
import qualified Maybe import qualified Prelude |
|||||||||||||||||
findIndex :: (a -> Bool) -> [a] -> Maybe Int
|
|||||||||||||||||
findIndices :: (a -> Bool) -> [a] -> [Int]
|
|||||||||||||||||
|
import qualified List import qualified Prelude |
|||||||||
listToMaybe :: [a] -> Maybe a
|
case vv1 of (x,i) → if p x then i : [] else [] _ → []
findIndices00 p (x,i) = if p x then i : [] else [] findIndices00 p _ = []
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ IFR
((findIndex :: (a -> Bool) -> [a] -> Maybe Int) :: (a -> Bool) -> [a] -> Maybe Int) |
import qualified Maybe import qualified Prelude |
|||||||||
findIndex :: (a -> Bool) -> [a] -> Maybe Int
|
|||||||||
findIndices :: (a -> Bool) -> [a] -> [Int]
|
|||||||||
|
|||||||||
|
import qualified List import qualified Prelude |
|||||||||
listToMaybe :: [a] -> Maybe a
|
if p x then i : [] else []
findIndices000 i True = i : [] findIndices000 i False = []
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ IFR
↳ HASKELL
↳ BR
((findIndex :: (a -> Bool) -> [a] -> Maybe Int) :: (a -> Bool) -> [a] -> Maybe Int) |
import qualified Maybe import qualified Prelude |
|||||||||
findIndex :: (a -> Bool) -> [a] -> Maybe Int
|
|||||||||
findIndices :: (a -> Bool) -> [a] -> [Int]
|
|||||||||
|
|||||||||
|
|||||||||
|
import qualified List import qualified Prelude |
|||||||||
listToMaybe :: [a] -> Maybe a
|
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ IFR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
((findIndex :: (a -> Bool) -> [a] -> Maybe Int) :: (a -> Bool) -> [a] -> Maybe Int) |
import qualified Maybe import qualified Prelude |
|||||||||
findIndex :: (a -> Bool) -> [a] -> Maybe Int
|
|||||||||
findIndices :: (a -> Bool) -> [a] -> [Int]
|
|||||||||
|
|||||||||
|
|||||||||
|
import qualified List import qualified Prelude |
|||||||||
listToMaybe :: [a] -> Maybe a
|
undefined
| False
= undefined
undefined = undefined1
undefined0 True = undefined
undefined1 = undefined0 False
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ IFR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ NumRed
((findIndex :: (a -> Bool) -> [a] -> Maybe Int) :: (a -> Bool) -> [a] -> Maybe Int) |
import qualified Maybe import qualified Prelude |
|||||||||
findIndex :: (a -> Bool) -> [a] -> Maybe Int
|
|||||||||
findIndices :: (a -> Bool) -> [a] -> [Int]
|
|||||||||
|
|||||||||
|
|||||||||
|
import qualified List import qualified Prelude |
|||||||||
listToMaybe :: [a] -> Maybe a
|
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ IFR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
(findIndex :: (a -> Bool) -> [a] -> Maybe Int) |
import qualified Maybe import qualified Prelude |
|||||||||
findIndex :: (a -> Bool) -> [a] -> Maybe Int
|
|||||||||
findIndices :: (a -> Bool) -> [a] -> [Int]
|
|||||||||
|
|||||||||
|
|||||||||
|
import qualified List import qualified Prelude |
|||||||||
listToMaybe :: [a] -> Maybe a
|
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ IFR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ QDP
↳ QDPSizeChangeProof
new_listToMaybe(wx8, wx3, :(wx41110, wx41111), ba) → new_listToMaybe0(wx3, wx41110, wx41111, new_primPlusNat(wx8), new_primPlusNat(wx8), ba)
new_listToMaybe0(wx3, wx4110, wx4111, wx8, wx7, ba) → new_listToMaybe(wx8, wx3, wx4111, ba)
new_primPlusNat(Zero) → Succ(Zero)
new_primPlusNat0(Succ(wx800)) → Succ(wx800)
new_primPlusNat(Succ(wx80)) → Succ(Succ(new_primPlusNat0(wx80)))
new_primPlusNat0(Zero) → Zero
new_primPlusNat(Succ(x0))
new_primPlusNat(Zero)
new_primPlusNat0(Zero)
new_primPlusNat0(Succ(x0))
From the DPs we obtained the following set of size-change graphs: